Computational Complexity of a Problem Arising in Fixed Order Output Feedback Design
نویسندگان
چکیده
This paper is concerned with a matrix inequality problem which arises in xed order output feedback control design. This problem involves nding two symmetric and positive deenitive matrices X and Y such that they each satisses a linear matrix inequality and that XY = I. It is well-known that many control problems such as xed order output feedback stabilization, H 1 control, guaranteed H 2 control, and mixed H 2 =H 1 control can all be converted into the matrix inequality problem above, including static output feedback problems as a special case. We show, however, that this matrix inequality problem is NP-hard.
منابع مشابه
Singular Perturbation Theory in Output Feedback Control of Pure-Feedback Systems
This paper studies output feedback control of pure-feedback systems with immeasurable states and completely non-affine property. Since availability of all the states is usually impossible in the actual process, we assume that just the system output is measurable and the system states are not available. First, to estimate the immeasurable states a state observer is designed. Relatively fewer res...
متن کاملOn the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملSolving the Fixed Charge Transportation Problem by New Heuristic Approach
The fixed charge transportation problem (FCTP) is a deployment of the classical transportation problem in which a fixed cost is incurred, independent of the amount transported, along with a variable cost that is proportional to the amount shipped. Since the problem is considered as an NP-hard, the computational time grows exponentially as the size of the problem increases. In this pape...
متن کاملConvergent LMI relaxations for non-convex optimization over polynomials in control
It is well known that most analysis and design problems in robust and nonlinear control can be formulated as global optimization problems with polynomial objective functions and constraints [1]. Typical examples include robust stability analysis for characteristic polynomials with parametric uncertainty, simultaneous stabilization of linear systems, pole assignment by static output feedback, an...
متن کاملController Design of SSSC for power System Stability Enhancement
In this paper, a novel method is developed for designing the output feedback controller for Static Synchronous Series Compensator (SSSC). In the proposed method, the problem of selecting the output feedback gains for the SSSC controllers is changed into an optimization problem with a time domain-based objective function.Then, it is solved by using the particle swarm optimization (PSO) algorithm...
متن کامل